An Evaluation of New NAG Library Solvers for Large Sparse Unsymmetric Linear Systems
نویسنده
چکیده
This report presents an experimental comparison of NAG Fortran Library software for the solution of large sparse unsymmetric linear systems of algebraic equations Preconditioned RGMRES CGS and Bi CGSTAB methods to be introduced at Mark are compared against one another and against direct methods Test problems include discrete approximations to D elliptic partial di erential equations random valued randomly structured unsymmetric systems and matrices from the Harwell Boeing collection
منابع مشابه
An Evaluation of New NAG Library Solvers for Large Sparse Symmetric Linear Systems
This report presents experimental results for new NAG Fortran Library software for the solution of large sparse symmetric linear systems of algebraic equations Preconditioned conjugate gradient methods introduced at Mark are compared against iterative and direct methods previously available in the library Test problems include discrete approximations to d elliptic partial di erential equations ...
متن کاملMA 42 – A new frontal code for solving sparse unsymmetric systems
We describe the design, implementation, and performance of a frontal code for the solution of large sparse unsymmetric systems of linear equations. The resulting software package, MA42, is included in Release 11 of the Harwell Subroutine Library and is intended to supersede the earlier MA32 package. We discuss in detail design changes from the earlier code, indicating the way in which they aid ...
متن کاملImproved Symbolic and Numerical Factorization Algorithms for Unsymmetric Sparse Matrices
We present algorithms for the symbolic and numerical factorization phases in the direct solution of sparse unsymmetric systems of linear equations. We have modified a classical symbolic factorization algorithm for unsymmetric matrices to inexpensively compute minimal elimination structures. We give an efficient algorithm to compute a near-minimal data-dependency graph for unsymmetric multifront...
متن کاملA new row ordering strategy for frontal solvers
A new row ordering strategy for frontal solvers. Abstract The frontal method is a variant of Gaussian elimination that has been widely used since the mid 1970s. In the innermost loop of the computation the method exploits dense linear algebra kernels, which are straightforward to vectorize and parallelize. This makes the method attractive for modern computer architectures. However, unless the m...
متن کاملNew parallel sparse direct solvers for engineering applications
At the heart of many computations in engineering lies the need to efficiently and accurately solve large sparse linear systems of equations. Direct methods are frequently the method of choice because of their robustness, accuracy and their potential for use as black-box solvers. In the last few years, there have been many new developments and a number of new modern parallel general-purpose spar...
متن کامل